Error Bounds for Sequential Monte Carlo Samplers for Multimodal Distributions
نویسندگان
چکیده
In this paper, we provide bounds on the asymptotic variance for a class of sequential Monte Carlo (SMC) samplers designed for approximating multimodal distributions. Such methods combine standard SMC methods and Markov chain Monte Carlo (MCMC) kernels. Our bounds improve upon previous results, and unlike some earlier work, they also apply in the case when the MCMC kernels can move between the modes. We apply our results to the Potts model from statistical physics. In this case, the problem of sharp peaks is encountered. Earlier methods, such as parallel tempering, are only able to sample from it at an exponential (in an important parameter of the model) cost. We propose a sequence of interpolating distributions called interpolation to independence, and show that the SMC sampler based on it is able to sample from this target distribution at a polynomial cost. We believe that our method is generally applicable to many other distributions as well.
منابع مشابه
Sequential Monte Carlo samplers: error bounds and insensitivity to initial conditions
This paper addresses nite sample stability properties of sequential Monte Carlo methods for approximating sequences of probability distributions. The results presented herein are applicable in the scenario where the start and end distributions in the sequence are xed and the number of intermediate steps is a parameter of the algorithm. Under assumptions which hold on non-compact spaces, it is s...
متن کاملMeasuring the non-asymptotic convergence of sequential Monte Carlo samplers using probabilistic programming
A key limitation of sampling algorithms for approximate inference is that it is difficult to quantify their approximation error. Widely used sampling schemes, such as sequential importance sampling with resampling and MetropolisHastings, produce output samples drawn from a distribution that may be far from the target posterior distribution. This paper shows how to upper-bound the symmetric KL d...
متن کاملError Bounds and Normalizing Constants for Sequential Monte Carlo Samplers in High Dimensions
In this article we develop a collection of results associated to the analysis of the Sequential Monte Carlo (SMC) samplers algorithm, in the context of high-dimensional i.i.d. target probabilities. The SMC samplers algorithm can be designed to sample from a single probability distribution, using Monte Carlo to approximate expectations w.r.t. this law. Given a target density in d−dimensions our ...
متن کاملStability of Sequential Markov Chain Monte Carlo Methods
Sequential Monte Carlo Samplers are a class of stochastic algorithms for Monte Carlo integral estimation w.r.t. probability distributions, which combine elements of Markov chain Monte Carlo methods and importance sampling/resampling schemes. We develop a stability analysis by funtional inequalities for a nonlinear flow of probability measures describing the limit behavior of the methods as the ...
متن کاملOptimization assisted MCMC
Markov Chain Monte Carlo (MCMC) sampling methods are widely used but often encounter either slow convergence or biased sampling when applied to multimodal high dimensional distributions. In this paper, we present a general framework of improving classical MCMC samplers by employing a global optimization method. The global optimization method first reduces a high dimensional search to an one dim...
متن کامل